package com.ting.test.algorithms.前缀树;

import java.util.HashMap;

public class NodeWithHashMap {
    /**
     * pass 表示经过该节点的线段个数
     */
    protected int pass;
    /**
     * end表示以该节点结尾的线段个数
     */
    protected int end;
    /**
     * next数组表示与他相邻的节点
     * 默认26个小写字母
     */
    protected HashMap next;

    public NodeWithHashMap() {
        pass = 0;
        end = 0;
        next = new HashMap<Integer,NodeWithHashMap>();
    }

    public int getPass() {
        return pass;
    }

    public int getEnd() {
        return end;
    }

    public HashMap getNext() {
        return next;
    }

    public void setPass(int pass) {
        this.pass = pass;
    }

    public void setEnd(int end) {
        this.end = end;
    }

    public void setNext(HashMap next) {
        this.next = next;
    }
}
